Bounds on optimal values in stochastic scheduling
نویسندگان
چکیده
منابع مشابه
Bounds on optimal values in stochastic scheduling
Consistent stochastic orders of processing times and objective functions yield optimal policies in many stochastic scheduling problems. When these orders fail to hold, however, finding optimal values may be difficult. In this paper, we show how to bound these values in general situations including problems with unreliable machines and tardiness-based objectives.
متن کاملSub-optimal Sensor Scheduling with Error Bounds
In this paper the problem of sub-optimal sensor scheduling with a guaranteed distance to optimality is considered. Optimal in the sense that the sequence that minimizes the estimation error covariance matrix for a given time horizon is found. The search is done using relaxed dynamic programming. The algorithm is then applied to one simple second order system and one sixth order model of a fixed...
متن کاملOptimal Lower Bounds for Anonymous Scheduling Mechanisms
We consider the problem of designing truthful mechanisms on m unrelated machines, to minimize some optimization goal. Nisan and Ronen (1999) consider the specific goal of makespan minimization, and show a lower bound of 2, and an upper bound of m. This large gap inspired many attempts that yielded positive results for several special cases, but very partial success for the general case: the low...
متن کاملLower Bounds for Smith's Rule in Stochastic Machine Scheduling
We consider the problem to minimize the weighted sum of completion times in nonpreemptive parallel machine scheduling. In a landmark paper from 1986, Kawaguchi and Kyan [5] showed that scheduling the jobs according to the WSPT rule –also known as Smith’s rule– has a performance guarantee of 1 2 (1 + √ 2) ≈ 1.207. They also gave an instance to show that this bound is tight. We consider the stoch...
متن کاملOptimal Factory Scheduling using Stochastic Dominance A*
We examine a standard factory scheduling problem with stochastic processing and setup times, minimizing the expectation of the weighted number of tardy jobs. Because the costs of operators in the schedule are stochastic and sequence dependent, standard dynamic programming algorithms such as A* may fail to find the optimal schedule. The SDA * (Stochastic Dominance A*) algo rithm remedies this d...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Operations Research Letters
سال: 1997
ISSN: 0167-6377
DOI: 10.1016/s0167-6377(97)00017-5